This course focuses on the underlying techniques for the
computer-aided design of VLSI circuits. Students are expected
to learn and implement the algorithms for aiding VLSI designs.

A. Course Contents:
1. Introduction to VLSI Design and Design Automation Tools (3 hrs)
2. Algorithmic Graph Theory and Computational Complexity (3 hrs)
3. General-purpose Methods for Combinatorial Optimization (3 hrs)
4. Physical Design: (15 hrs)
Partitioning,
Floorplanning/Placement,
Routing,
Compaction
5. Logic Synthesis (6 hrs)
6. Formal verification (6 hrs)
6. Simulation (4 hrs)
7. High-level Synthesis (2 hrs)
8. Testing (6 hrs)
9. Projects & Presentations (3 hrs)

B.Text:
S. H. Gerez, Algorithms for VLSI Design Automation, John Wiley & Sons, 1999.

C.Grading:
1.Four homework assignments 25%
2.Two programming assignments 25%
3.One in-class test 30%
4.Project 20%
(default project: select one problem from the 2005 IC/CAD
Contest hosted by the Ministry of Education)
See http://www.ee.ncu.edu.tw/~cad_contest for the
contest information.

D.Prerequisites:
1. logic design
2. At least one course in data structures, algorithms, or
discrete mathematics